Edge Caching in Delay-Constrained Virtualized Cellular Networks: Analysis and Market
نویسندگان
چکیده
Caching of popular contents at cellular base stations, i.e., edge caching, in order to eliminate duplicate transmission through the backhaul can reduce the latency of data delivery in 5G networks. However, since caching can only reduce the backhaul delay, techniques such as base station densification will also need to be used to reduce the fronthaul delay. In this paper, using results from stochastic geometry, we first model the effects of base station densification and cache size on the latency of the system. We then derive a tight approximation for the cache hit probability. To optimize the network cost due to the deployment of base station (BS) and cache storage, a minimization problem for the product of the BS intensity and cache size is formulated under probabilistic delay constraint, which is converted into a geometric program and solved analytically. The results are then used to analyze the economics of a cache-enabled virtualized cellular network where the network infrastructure, i.e., BSs and cache storage, owned by an infrastructure provider (InP) is shared among multiple mobile network operators (MNOs). For the pricing between the InP and the MNOs, we formulate a Stackelberg game with the InP as the leader and multiple MNOs as the followers. In this virtualized scenario, the common cost of renting the infrastructure is shared in a fair manner among the MNOs by using the Shapely value. An efficient algorithm is provided to divide the rent among MNOs. T. Sanguanpuak, N. Rajatheva, and M. Latva-aho are with the Centre for Wireless Communications (CWC), Dept. of Commun. Eng., University of Oulu, Finland (E-mails: {tachporn.sanguanpuak, nandana.rajathava, matti.latva-aho}@oulu.fi). S. Guruacharya and E. Hossain are with the Department of Electrical and Computer Eng., University of Manitoba, Canada (E-mails: {Sudarshan.Guruacharya, Ekram.Hossain}@umanitoba.ca). D. Niyato is with School of Comp. Science and Eng., Nanyang Technological University (E-mail: [email protected]). February 14, 2018 DRAFT
منابع مشابه
A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory
The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...
متن کاملA Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory
The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...
متن کاملCooperative Edge Caching in User-Centric Clustered Mobile Networks
With files proactively stored at base stations (BSs), mobile edge caching enables direct content delivery without remote file fetching, which can reduce the end-to-end delay while relieving backhaul pressure. To effectively utilize the limited cache size in practice, cooperative caching can be leveraged to exploit caching diversity, by allowing users served by multiple base stations under the e...
متن کاملEdge Caching in Dense Heterogeneous Cellular Networks with Massive MIMO Aided Self-backhaul
This paper focuses on edge caching in dense heterogeneous cellular networks (HetNets), in which small base stations (SBSs) with limited cache size store the popular contents, and massive multiple-inputmultiple-output (MIMO) aided macro base stations provide wireless self-backhaul when SBSs require the non-cached contents. Our aim is to address the effects of cell load and hit probability on the...
متن کاملA Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1802.04769 شماره
صفحات -
تاریخ انتشار 2018